Discrete Cosine Transform: A Revolutionary Transform That Transformed Human Lives [CAS 101]

نویسندگان

چکیده

The widely known Discrete Fourier Transform (DFT), the frequency-domain representation of a finite-length time-domain sequence is an orthogonal transform and has been for very long time found many application. popularity DFT increased tremendously after publication Fast (FFT) algorithm by Cooley Tukey in 1965 [1] . Orthogonal transforms offer advantages, namely fast computational speeds, less storage space, rounding off errors, etc. benefits stem from fact that they can be factored based on matrix computations. Data compression, digital filter design, speech processing, image video processing are applications where have made significant impact.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

JPEG Encoder using Discrete Cosine Transform & Inverse Discrete Cosine Transform

In the past decade, the advancement in data communications was significant during explosive growth of the Internet, which led to the demand for using multimedia in portable devices. Video and Audio data streams require a huge amount of bandwidth to be transferred in an uncompressed form. The objective of this paper is to minimize the number of bits required to represent an image and also the ac...

متن کامل

On discrete cosine transform

The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In simulating the discrete cosine transform, we propose a generalized discrete cosine transform with three parameters, and prove its orthogonality for some new...

متن کامل

Discrete cosine transform

The discrete cosine transform (DCT) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. It is equivalent to a DFT of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), where in some variants the input and/or output data are shifted by half a sampl...

متن کامل

The Discrete Cosine Transform

Each Discrete Cosine Transform uses N real basis vectors whose components are cosines. In the DCT-4, for example, the jth component of v k is cos(j + 1 2)(k + 1 2) N. These basis vectors are orthogonal and the transform is extremely useful in image processing. If the vector x gives the intensities along a row of pixels, its cosine series P c k v k has the coeecients c k = (x; v k)=N. They are q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Circuits and Systems Magazine

سال: 2022

ISSN: ['1558-0830', '1531-636X']

DOI: https://doi.org/10.1109/mcas.2022.3214566